Linear-Time Temporal Answer Set Programming
نویسندگان
چکیده
Abstract In this survey, we present an overview on (Modal) Temporal Logic Programming in view of its application to Knowledge Representation and Declarative Problem Solving. The syntax extension logic programs is the result combining usual rules with temporal modal operators, as Linear-time (LTL). paper, focus main recent results non-monotonic formalism called Equilibrium (TEL) that defined for full LTL but involves a model selection criterion based , well known logical characterization Answer Set (ASP). As result, obtain proper stable models semantics general case formulas LTL. We recall basic definitions TEL monotonic basis, Here-and-There (THT), study differences between finite infinite trace length. also provide further useful results, such translation into other formalisms like Quantified Second-order LTL, some techniques computing automata constructions. remainder practical aspects, defining syntactic fragment (modal) closer ASP, explaining how has been exploited construction solver telingo well-known ASP clingo uses incremental solving capabilities.
منابع مشابه
Temporal Answer Set Programming
Answer Set Programming (ASP) has become a popular way for representing different kinds of scenarios from knowledge representation in Artificial Intelligence. Frequently, these scenarios involve a temporal component which must be considered. In ASP, time is usually represented as a variable whose values are defined by an extensional predicate with a finite domain. Dealing with a finite temporal ...
متن کاملIntegrating Temporal Extensions of Answer Set Programming
In this paper we study the relation between the two main extensions of Answer Set Programming with temporal modal operators: Temporal Equilibrium Logic (TEL) and Temporal Answer Sets (TAS). On the one hand, TEL is a complete non-monotonic logic that results from the combination of Linear-time Temporal Logic (LTL) with Equilibrium Logic. On the other hand, TAS is based on a richer modal approach...
متن کاملAnnotated Answer Set Programming
We present Annotated Answer Set Programming, that extends the expressive power of disjunctive logic programming with annotation terms, taken from the generalized annotated logic programming framework.
متن کاملConstraint Answer Set Programming
Constraint answer set programming (CASP) is a novel, promising direction of research whose roots go back to propositional satisfiability (SAT). SAT solvers are efficient tools for solving boolean constraint satisfaction problems that arise in different areas of computer science, including software and hardware verification. Some constraints are more naturally expressed by non-boolean constructs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2021
ISSN: ['1471-0684', '1475-3081']
DOI: https://doi.org/10.1017/s1471068421000557